Minimum-Weight Edge Discriminators in Hypergraphs
نویسندگان
چکیده
منابع مشابه
Minimum-Weight Edge Discriminators in Hypergraphs
In this paper we introduce the notion of minimum-weight edge-discriminators in hypergraphs, and study their various properties. For a hypergraph H = (V,E ), a function λ : V → Z+∪{0} is said to be an edge-discriminator onH if∑v∈Ei λ(v) > 0, for all hyperedges Ei ∈ E , and ∑ v∈Ei λ(v) 6= ∑ v∈Ej λ(v), for every two distinct hyperedges Ei, Ej ∈ E . An optimal edge-discriminator on H, to be denoted...
متن کاملEdge search in hypergraphs
Consider an undirected hypergraph H = (X, E) with a probability distribution P on the set E of its hyperedges. We investigate the average case complexity L(H, P) of finding an unknown hyperedge e*e E, chosen according to P, if only tests are allowed that check, whether e* is contained in the induced subhypergraphs H [ Y ] for Y c X, or not. In this note we prove that for hypergraphs with averag...
متن کاملMinimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
متن کاملComputing minimum cuts in hypergraphs
We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph H = (V, E) with n= |V |, m= |E| and p = ∑ e∈E |e| the fastest known algorithm to compute a global minimum cut in H runs in O(np) time for the uncapacitated case, and in O(np+ n2 log n) time for the capacitated case. We show the following new results. • Given an uncapacitated hypergraph H and an intege...
متن کاملMinimum Cost Flows on Hypergraphs
Directed hypergraphs have been introduced quite recently in connection with different application areas, such as propositional satisfiability, deductive data bases and Leontief substitution systems. In [Jeroslow, Martin, Rardin&Wang, 1989], the uncapacitated min-cost flow problem on hypergraphs is considered, and its properties are studied. Here we address the capacitated case, and show how the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/3551